Asymptotics of the extremal excedance set statistic

نویسندگان

  • Rodrigo Ferraz de Andrade
  • Erik Lundberg
  • Brendan Nagle
چکیده

For non-negative integers r and s with r + s = n − 1, let [bras] denote the number of permutations π ∈ Sn which have the property that π(i) > i if, and only if, i ∈ [r] = {1, . . . , r}. Answering a question of Clark and Ehrenborg (2010), we determine asymptotics on [bras] when r = b(n− 1)/2c: [ bb(n−1)/2cad(n−1)/2e ] = ( 1 2 log 2 √ (1− log 2) + o(1) )( 1 2 log 2 )n n!. We also determine asymptotics on [bras] for a suitably related r = Θ(s) → ∞. Our proof depends on multivariate asymptotic methods of R. Pemantle and M. C. Wilson. We also consider two applications of our main result. One, we determine asymptotics on the number of permutations π ∈ Sn which simultaneously avoid the vincular patterns 21-34 and 34-21, i.e., for which π is order-isomorphic to neither (2,1,3,4) nor (3, 4, 2, 1) on any coordinates 1 ≤ i < i+1 < j < j+1 ≤ n. We also determine asymptotics on the number of n-cycles π ∈ Cn which avoid stretching pairs, i.e., those for which 1 ≤ π(i) < i < j < π(j) ≤ n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof of a Conjecture of Ehrenborg and Steingrímsson on Excedance Statistic

Very recently, Ehrenborg and Steingrı́msson [7] studied enumerative properties of the excedance statistic. Let Sn denote the permutation group on the set {1, 2, . . . , n} and π = π1 π2 · · ·πn ∈ Sn . An excedance in π is an index i such that πi > i . Following [7], we encode the excedance set of a permutation as a word in the letters a and b. The excedance word w(π) of π is the ab-word w1w2 · ·...

متن کامل

Explicit expressions for the extremal excedance set statistics

Abstract The excedance set of a permutation π = π1π2 · · ·πk is the set of indices i for which πi > i. We give explicit formulas for the number of permutations whose excedance set is the initial segment {1, 2, . . . ,m} and also of the form {1, 2, . . . ,m,m + 2}. We provide two proofs. The first is an explicit combinatorial argument using rook placements. The second uses the chromatic polynomi...

متن کامل

Enumerative Properties of Ferrers Graphs

We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial and the chromatic symmetric function. We show that the linear coefficient of the chromatic polynomial is given by the excedance set statistic.

متن کامل

Szegö Asymptotics of Extremal Polynomials on the Segment [−1, +1]: the Case of a Measure with Finite Discrete Part

The strong asymptotics of monic extremal polynomials with respect to the norm Lp(σ) are studied. The measure σ is concentrated on the segment [−1, 1] plus a finite set of mass points in a region of the complex plane exterior to the segment [−1, 1]. 2000 Mathematics Subject Classification: 42C05, 30E15, 30E10.

متن کامل

On the Excedance Sets of Colored Permutations

We define the excedence set and the excedance word on Gr,n, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2015